Communication - Processor Tradeo s in Limited Resources

نویسندگان

  • Adnan Agbaria
  • Yosi Ben-Asher
  • Ilan Newman
چکیده

We consider a simple restriction of the PRAM model (called PPRAM), where the input is arbitrarily partitioned between a xed set of p processors and the shared memory is restricted to m cells. This model allows for investigating the tradeoos/ bottlenecks with respect to the communication bandwidth (modeled by the shared memory size m) and the number of processors p. The model is quite simple and allows the design of optimal algorithms without loosing the eeect of communication bottlenecks. We have focused on the PPRAM complexity of problems that have O(n) sequential solutions (where n is the input size), and where m p n. We show tight time bounds for several problems in this model such as summing, Boolean threshold, routing, integer sorting, list reversal and k-selection. We get typically two sorts of complexity behaviors for these problems: Either ~ O(n=p+p=m) which means that the time scales with the number of processors and with memory size (in appropriate range) but not with both. The other is a ~ O(n=m) which does not scales with p and reeects a communication bottleneck (as long as m < p). We are not aware of any problem whose complexity scales with both p and m (e.g O(n p mp)). This might explain why in actual implementations one often fails to get p-scalability for p close to n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Uni ed Algorithm for Load-balancing Adaptive Scienti c Simulations

Adaptive scienti c simulations require that periodic repartitioning occur dynamically throughout the course of the simulation. The computed repartitionings should minimize both the inter-processor communications incurred during the iterative mesh-based computation and the data redistribution costs required to balance the load. Recently developed schemes for computing repartitionings provide the...

متن کامل

LiquiMedia | A dynamically extensible cyclic executive

Because it involves theoretical latencies that are unbounded, and practical latencies that are large, dynamic resource allocation poses di cult problems for all real-time systems. Control applications, where the task environment and range of possible computations are both highly constrained, can solve this problem using static allocation, with all allocation occurring outside of the realtime co...

متن کامل

An Evaluation of Grouping Techniques for State Dissemination in Networked Multi-User Games

In a distributed multi-user game, entities need to communicate their state information to other entities. Usually only a subset of the game's entities are interested in information being disseminated by any particular entity. In a large scale distributed game with many machines interconnected by a wide-area network, broadcasting messages containing each information to all participants and apply...

متن کامل

Load Balance and Communication Tradeo s in Parallel

In block-partitioned parallel matrix factorization algorithms, where the matrix is distributed over a logical torus processor grid with an rs block-cyclic matrix distribution, the greatest scope for optimization exists in the formation of (block) panels. Let ! be the panel width, with ! m being an optimal value based on the characteristics a single processor's memory hierarchy. To date, two wel...

متن کامل

Vision-Motion Planning of a Mobile Robot considering Vision Uncertainty and Planning Cost

This paper proposes a planning method for a vision-guided mobile robot under vision uncertainty and limited computational resources. The method considers the following two tradeo s: (1) granularity in approximating a probabilistic distribution vs. plan quality, and (2) search depth vs. plan quality. The rst tradeo is managed by predicting the plan quality for a granularity using a learned relat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007